Piecewise-Linear Pathways to the Optimal Solution Set in Linear Programming
نویسندگان
چکیده
منابع مشابه
Pathways to the Optimal Set in Linear Programming
This chapter presents continuous paths leading to the set of optimal solutions of a linear programming problem. These paths are derived from the weighted logarithmic barrier function. The defining equations are bilinear and have some nice primal-dual symmetry properties. Extensions to the general linear complementarity problem are indicated.
متن کاملThe optimal solution set of the interval linear programming problems
Determining the set of all optimal solutions of a linear program with interval data is one of the main problems discussed in interval optimization. We review two methods based on duality in linear programming, which are used to approximate the optimal set. Additionally, another decomposition method based on complementary slackness is proposed. This method provides the exact description of the o...
متن کاملPiecewise Linear Regularized Solution Paths
We consider the generic regularized optimization problem β̂(λ) = arg minβ L(y,Xβ) + λJ (β). Efron, Hastie, Johnstone and Tibshirani [Ann. Statist. 32 (2004) 407–499] have shown that for the LASSO—that is, if L is squared error loss and J (β)= ‖β‖1 is the 1 norm of β—the optimal coefficient path is piecewise linear, that is, ∂β̂(λ)/∂λ is piecewise constant. We derive a general characterization of ...
متن کاملOptimal Piecewise Linear Income Taxation
Optimal Piecewise Linear Income Taxation Given its significance in practice, piecewise linear taxation has received relatively little attention in the literature. This paper offers a simple and transparent analysis of its main characteristics. We fully characterize optimal tax parameters for the cases in which budget sets are convex and nonconvex respectively. A numerical analysis of a discrete...
متن کاملPiecewise linear quadratic optimal control
The use of piecewise quadratic cost functions is extended from stability analysis of piecewise linear systems to performance analysis and optimal control. Lower bounds on the optimal control cost are obtained by semi-definite programming based on the Bellman inequality. This also gives an approximation to the optimal control law. An upper bound to the optimal cost is obtained by another convex ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Optimization Theory and Applications
سال: 1997
ISSN: 0022-3239,1573-2878
DOI: 10.1023/a:1022651331550